MIME-Version: 1.0
Server: CERN/3.0
Date: Sunday, 24-Nov-96 22:45:52 GMT
Content-Type: text/html
Content-Length: 1580
Last-Modified: Monday, 18-Nov-96 14:31:37 GMT

<BASE HREF="http://www.cs.cornell.edu/Info/Courses/Fall-96/CS410/schedule.html">

<head> <title> CS410 </title> </head>
<body>

<center>
<h1> Tentative Course Schedule </h1>
<h2> Computer Science 410 <br> Fall 1996 </h2>
</center>     

<h3> Course text</h3>
T. H. Cormen, C. E. Leiserson, and R. L. Rivest, {\em Introduction
to Algorithms.} McGraw Hill, 1990.<BR>
Textbook can be purchased at the Campus Store or Triangle Bookshop.
The text unfortunately has a number of bugs and typos (especially
older printings). You should use the <a href="bug-list.ps">Text Errata </a>
(large ps file, close to 30 pages). 

<h3> Tentative Syllabus </h3>
The following syllabus will be refined as the course progresses.  Periodic 
announcements will be made in class, on the Web, and on the homeworks of 
required readings.  We will cover material from Chapters 1-6 as we need them. 

Aug 28: Intro, ADT, O(.) notation <BR>
Sept 3-10: Hashing (CLR 12, plus CLR 11.2)<BR>
Sept 12-17: Graphs (CLR 23) <BR>
Sept 19: Spanning tree (CLR 24) <BR>
Sept 24-Oct 1: Heaps (CLR 7) and Huffman codes (CLR 17.3) <BR>
Oct 3-8: Sorting (CLR 9) <BR>
Oct 10: Prelim 1 <BR>
Oct 15: Fall break <BR>
Oct 17-19: Binary Search Trees (CLR 13) <BR>
Oct 24: Red-Black Trees (CLR 14) <BR>
Oct 29:  Dynamic Data Structures (CLR 15) <BR>
Oct 31 - Nov 5: Union Find (CLR 22) <BR>
Nov 7-12: Lempel-Ziv compression <BR>
Nov 14: Prelim 2 <BR>
Nov 19-26: Shortest paths in Graphs ?? (CLR 25-26) <BR>
Nov 28: Thanksgiving break <BR>
Dec 3: Computational Geometry ?? (CLR 35)<BR>
Dec 5: Conclusion ??

Dec 16: final

</body>  
